Analytical Observations on Knapsack Cipher 0/255
نویسندگان
چکیده
We observed few important facts that concerns with the new proposal of knapsack cipher 0/255, recently published by Pham [1]. The author claimed that the time complexity for solving new improved trapdoor knapsack is O(256). In this paper, we show that the knapsack cipher 0/255 can be solved in the same time that is required for solving the basic knapsack-cipher proposed by Merkle and Hellman [2]. In other words we claim that the improved version proposed by Pham [1] is technically same as the basic Merkle and Hellman Knapsack-based cryptosystem.
منابع مشابه
Genetic Algorithm solution for Cryptanalysis of Knapsack Cipher with Knapsack Sequence of Size 16
With growth of networked systems and applications such as ecommerce, the demand for internet security is increasing. Information can be secured using cryptography, anti-virus, malwares, spywares, firewall etc. In cryptology, cryptanalysis is a discipline where the ciphers are attacked and broke thus enabling the developers to strengthen the cipher. Nowadays cryptanalysis of ciphers is gaining p...
متن کاملKnapsack Cipher and Cryptanalyst Using Heuristic Methods
This paper describes a method of a cryptanalyst for a knapsack cipher. The deciphering method is based on the application of a heuristic random search hill-climbing algorithm, together with a genetic algorithm. It is shown that such an algorithm, implemented in Matlab environment, could be used to break a knapsack cipher. Some other aspects of the problem are discussed, too.
متن کاملAn Enhanced Cryptanalytic Attack on Knapsack Cipher using Genetic Algorithm
With the exponential growth of networked system and application such as eCommerce, the demand for effective internet security is increasing. Cryptology is the science and study of systems for secret communication. It consists of two complementary fields of study: cryptography and cryptanalysis. The application of genetic algorithms in the cryptanalysis of knapsack ciphers is suggested by Spillm...
متن کاملBit and Byte Level Generalized Modified Vernam Cipher Method with Feedback
In the present paper the authors have introduced a new symmetric key cryptographic method where they have clubbed both bit level and byte level generalized modified vernam cipher method with feedback. Nath et al already developed methods bit level encryption standard(BLES) Ver-I and Ver-II where they have used extensive bit level permutation, bit exchange, bit xor and bit shift encryption metho...
متن کاملContravening Esotery: Cryptanalysis of Knapsack Cipher using Genetic Algorithms
Cryptanalysis of knapsack cipher is a fascinating problem which has eluded the computing fraternity for decades. However, in most of the cases either the time complexity of the proposed algorithm is colossal or an insufficient number of samples have been taken for verification. The present work proposes a Genetic Algorithm based technique for cryptanalysis of knapsack cipher. The experiments co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1312.3740 شماره
صفحات -
تاریخ انتشار 2013